Thesplit feasibility problem arises inmany fields in the realworld, such as signal processing, image reconstruction, and medical care.\nIn this paper, we present a solution algorithm called memory gradient projection method for solving the split feasibility problem,\nwhich employs a parameter and two previous iterations to get the next iteration, and its step size can be calculated directly. It not\nonly improves the flexibility of the algorithm, but also avoids computing the largest eigenvalue of the related matrix or estimating\nthe Lipschitz constant in each iteration. Theoretical convergence results are established under some suitable conditions.
Loading....